Derivation of Parallel Algorithms from Functional Specifications to CSP Processes
نویسنده
چکیده
A transformational programming approach is proposed as a means for developing a class of parallel algorithms from clear functional speci cations to e cient networks of communicating sequential processes CSP A foundation for the systematic re nement of functional speci ca tions into CSP processes is established Techniques for exhibiting implicit parallelism in functional speci cation are developed Their use is illus trated by deriving new e cient parallel algorithms to several problems Derivation and reasoning are conducted in an equational style using the calculus for program synthesis developed by Bird and Meertens
منابع مشابه
Formal Derivation of Two Parallel Rendering Algorithms
This paper presents the formal deriva tions of two parallel rendering algorithms from a high level speci cation The initial speci cation of the problem is formulated as a functional program A calculational approach is used to derive from the original speci cation two parallel algorithms expressed as networks of communicating processes in Hoare s CSP Both algorithms exploit pipelined parallelism...
متن کاملDerivation of Scalable Message-Passing Algorithms Using Parallel Combinatorial List Generator Functions
We present the transformational derivations of several efficient, scalable, message-passing parallel algorithms from clear functional specifications. The starting algorithms rely on some commonly used combinatorial list generator functions such as tails, inits, splits and cp (Cartesian product) for generating useful intermediate results. This paper provides generic parallel algorithms for effic...
متن کاملA Refinement Calculus for Communicating Processes with State
A uniform treatment is presented of specifications, programs, and programming for communicating processes with machine state. The treatment is based on addition of a specification statement to a CSP-like language. The extended language is viewed as a specification language in which programs are identified with a subclass of specifications. A semantics is provided and here a selection of sound r...
متن کاملCompositional Modelling and Reasoning in an Institution for Processes and Data
The language Csp-Casl combines specifications of data and processes. We give an institution based semantics to Csp-Casl that allows us to re-use the institution independent structuring mechanisms of Casl. Furthermore, we extend Csp-Casl with a notion of refinement that reconciles the differing philosophies behind the refinement notions for Csp and Casl. We develop a compositional proof calculus...
متن کاملReliability Analysis of Csp Specifications: a New Method Using Petri Nets
Theoretical models like CSP and CCS describe computation using synchronization. Such models define independent system entities or processes that cooperate by explicit communication. In safety critical systems these communications represent visible actions which, if they do not occur or are delayed beyond their deadline, will cause a failure to occur. This paper describes the basic methodology f...
متن کامل